An Extremal Series of Eulerian Synchronizing Automata
نویسندگان
چکیده
We present an infinite series of n-state Eulerian automata whose reset words have length at least (n − 3)/2. This improves the current lower bound on the length of shortest reset words in Eulerian automata. We conjecture that (n − 3)/2 also forms an upper bound for this class and we experimentally verify it for small automata by an exhaustive computation.
منابع مشابه
Synchronizing Automata with Extremal Properties
We present a few classes of synchronizing automata exhibiting certain extremal properties with regard to synchronization. The first is a series of automata with subsets whose shortest extending words are of length Θ(n 2), where n is the number of states of the automaton. This disproves a conjecture that every subset in a strongly connected synchronizing automaton is cn-extendable, for some cons...
متن کاملSynchronizing Automata on Quasi-Eulerian Digraph
In 1964 Černý conjectured that each n-state synchronizing automaton posesses a reset word of length at most (n − 1). From the other side the best known upper bound on the reset length (minimum length of reset words) is cubic in n. Thus the main problem here is to prove quadratic (in n) upper bounds. Since 1964, this problem has been solved for few special classes of synchronizing automata. One ...
متن کاملThe Synchronization Problem for Strongly Transitive Automata
The synchronization problem for a deterministic n-state automaton consists in the search of an input-sequence, called a synchronizing word such that the state attained by the automaton, when this sequence is read, does not depend on the initial state of the automaton itself. If such a sequence exists, the automaton is called synchronizing. If the automaton is deterministic and complete, a well-...
متن کاملSynchronizing Finite Automata on Eulerian Digraphs
1 Cern2 y’s conjecture and the road coloring problem are two open problems concerning synchronization of !nite automata. We prove these conjectures in the special case that the vertices have uniform inand outdegrees. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملLower Bounds for the Length of Reset Words in Eulerian Automata
A complete deterministic finite automaton A is called synchronizing if the action of some word w resets A , that is, leaves the automaton in one particular state no matter at which state it is applied. Any such word w is said to be a reset word for the automaton. The minimum length of reset words for A is called the reset threshold of A and denoted by rt(A ). Synchronizing automata constitute a...
متن کامل